翻訳と辞書 |
Binary prioritization : ウィキペディア英語版 | Binary prioritization
Binary Prioritization is a sorting algorithm which prioritizes to-do tasks. Unlike other binary sort methods (e.g. binary search) this method assumes that the deferred work will be prioritized in a later process, but their order is not relevant in the first iteration. The faster processing of classified and important tasks is achieved by reducing the cost of sorting by not sorting the subset of the less important tasks. In each iteration, the cost is reduced by the sorted elements. == Application requirements == For the application of the binary prioritization it is assumed that the elements to be prioritized are present in an unsorted heap.
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Binary prioritization」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|